A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
نویسنده
چکیده
Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model was considered a hard problem for mutation-based algorithms, and the two-dimensional Ising model was even thought to amplify the difficulties. While in one dimension the Ising model does not have any local optima, in two dimensions it does. Here we prove that a simple search heuristic, the Metropolis algorithm, optimises on average the two-dimensional Ising model in polynomial time.
منابع مشابه
University of Dortmund
Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model was considered a hard problem for mutation-based algorithms, and the two-dimensional Ising model was even thought to amplify the difficulties. While in one dimension the Ising model does not have any local optima, in two dimens...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملMagnetic Properties in a Spin-1 Random Transverse Ising Model on Square Lattice
In this paper we investigate the effect of a random transverse field, distributed according to a trimodal distribution, on the phase diagram and magnetic properties of a two-dimensional lattice (square with z=4), ferromagnetic Ising system consisting of magnetic atoms with spin-1. This study is done using the effectivefield theory (EFT) with correlations method. The equations are derived using...
متن کامل